xy-Monotone Path Existence Queries in a Rectilinear Environment
نویسندگان
چکیده
Given a planar environment consisting of n disjoint axisaligned rectangles, we want to query on any two points and find whether there is a north-east monotone path between them. We present preprocessing and query algorithms which translate the geometric problem into a tree traversal problem and present a corresponding tree structure that gives usO(n log n) construction time, O(n) space, and O(log n) query time.
منابع مشابه
Fr{'e}chet and Hausdorff Queries on $x$-Monotone Trajectories
vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...
متن کاملSpanning Ratio and Maximum Detour of Rectilinear Paths in the L1 Plane
The spanning ratio and maximum detour of a graph G embedded in a metric space measure how well G approximates the minimum complete graph containing G and metric space, respectively. In this paper we show that computing the spanning ratio of a rectilinear path P in L1 space has a lower bound of Ω(n log n) in the algebraic computation tree model and describe a deterministic O(n log n) time algori...
متن کاملAngle-monotone Paths in Non-obtuse Triangulations
We reprove a result of Dehkordi, Frati, and Gudmundsson: every two vertices in a non-obtuse triangulation of a point set are connected by an angle-monotone path— an xy-monotone path in an appropriately rotated coordinate system. We show that this result cannot be extended to angle-monotone spanning trees, but can be extended to boundary-rooted spanning forests. The latter leads to a conjectural...
متن کاملA Rectilinear-Monotone Polygonal Fault Block Model for Fault-Tolerant Minimal Routing in Mesh
We propose a new fault block model, Minimal-Connected-Component (MCC), for fault-tolerant adaptive routing in meshconnected multiprocessor systems. This model refines the widely used rectangular model by including fewer nonfaulty nodes in fault blocks. The positions of source/destination nodes relative to faulty nodes are taken into consideration when constructing fault blocks. The main idea be...
متن کاملA Polynomial Time Approximation Scheme for the Symmetric Rectilinear Steiner Arborescence Problem
The Symmetric Rectilinear Steiner Arborescence (SRStA) problem is defined as follows: given a set of terminals in the positive quadrant of the plane, connect them using horizontal and vertical lines such that each terminal can be reached from the origin via a y-monotone path and the total length of all the line segments is the minimum possible. Finding an SRStA has applications in VLSI design, ...
متن کامل